Title: Socrates on Ip Router Fault Detection General Conference Topics: Communications Quality & Reliability, N E T Work Operations & Management Socrates on Ip Router Fault Detection
نویسندگان
چکیده
SOCRATES is a software system for testing correctness of im plementations of IP routing protocols such as RIP OSPF and BGP It uses a probabilistic algorithm to construct random network topologies For each generated network topology it checks the correctness of routing table cal culation and the IP packet forwarding behavior For OSPF it also checks the consistency between network topologies and the Link state Databases of Router under Test For BGP it further checks the BGP update redistribu tion Di erent than commercial testing tools which select their test cases in an ad hoc manner SOCRATES chooses test cases with a guaranteed fault
منابع مشابه
Management of DiffServ-over-MPLS Transit Networks with BFD/OAM in ForCES Architecture
This paper proposes a management of DiffServ-over-MPLS transit network with BFD(Bidirectional Forwarding Detection)/OAM (operation, administration and maintenance) in ForCES (Forwarding and Control Element Separation) architecture for QoS-guaranteed DiffServ-over-MPLS traffic engineering. The proposed BFD and ForCES functions are implemented on Intel 2400 network processor, where BFD/OAM packet...
متن کاملPractical QoS network system with fault tolerance
In this paper, we present an ‘emulation environment’ for the design and planning of QoS-enabled IP networks. Specifically, QoS support for real-time traffic in future IP networks require ‘fault tolerance’ for mission-critical applications such as tele-medicine. Based on this premise, our goal is to design the QoS network system for the traffic management so that QoS requirements are satisfied. ...
متن کاملA High Performance Parallel IP Lookup Technique Using Distributed Memory Organization and ISCB-Tree Data Structure
The IP Lookup Process is a key bottleneck in routing due to the increase in routing table size, increasing traıc and migration to IPv6 addresses. The IP address lookup involves computation of the Longest Prefix Matching (LPM), which existing solutions such as BSD Radix Tries, scale poorly when traıc in the router increases or when employed for IPv6 address lookups. In this paper, we describe a ...
متن کاملA High Performance Parallel IP Lookup Technique Using Distributed Memory Organization and ISCB-Tree Data Structure
The IP Lookup Process is a key bottleneck in routing due to the increase in routing table size, increasing traıc and migration to IPv6 addresses. The IP address lookup involves computation of the Longest Prefix Matching (LPM), which existing solutions such as BSD Radix Tries, scale poorly when traıc in the router increases or when employed for IPv6 address lookups. In this paper, we describe a ...
متن کاملN-Way Fail-Over Infrastructure for Reliable Servers and Routers
Maintaining the availability of critical servers and routers is an important concern for many organizations. At the lowest level, IP addresses represent the global namespace by which services are accessible on the Internet. We introduce Wackamole, a completely distributed software solution based on a provably correct algorithm that negotiates the assignment of IP addresses among the currently a...
متن کامل